Optimal Resource Allocation in Random Networks with Transportation Bandwidths

نویسندگان

  • C. H. Yeung
  • Michael Wong
چکیده

We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Recursive relations from the Bethe approximation are converted into useful algorithms. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node, the efficiency of allocation increases with the network connectivity. In the high connectivity limit, we find a phase transition at a critical bandwidth, above which clusters of balanced nodes appear, characterised by a profile of homogenized resource allocation similar to the Maxwell's construction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-organized Balanced Resources in Random Networks with Transportation Bandwidths

We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths for the transportation of resources along the links. We derive algorithms which searches the optimal solution without the need of a global optimizer. For networks with uniformly high connectivity, the resource shortage of a node becomes a well-defined function of its capacity. An eff...

متن کامل

Bicriteria Resource Allocation Problem in Pert Networks

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...

متن کامل

Self-Organization of Balanced Nodes in Random Networks with Transportation Bandwidths Self-Organization of Balanced Nodes

We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths along the transportation links. The mean-field approach is applicable when the connectivity is sufficiently high. It allows us to derive the resource shortage of a node as a well-defined function of its capacity. For networks with uniformly high connectivity, an efficient profile of ...

متن کامل

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009